TSTP Solution File: SET599^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET599^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:07:28 EDT 2024
% Result : Theorem 0.23s 0.40s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 24 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 133 ( 54 equ; 0 cnn)
% Maximal formula atoms : 12 ( 7 avg)
% Number of connectives : 173 ( 41 ~; 19 |; 33 &; 72 @)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 ^ 15 !; 12 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a > $o ).
thf(func_def_5,type,
sK1: a ).
thf(func_def_6,type,
sK2: a > $o ).
thf(f28,plain,
$false,
inference(avatar_sat_refutation,[],[f24,f25,f27]) ).
thf(f27,plain,
spl3_2,
inference(avatar_split_clause,[],[f15,f21]) ).
thf(f21,plain,
( spl3_2
<=> ( ( sK2 @ sK1 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f15,plain,
( ( sK2 @ sK1 )
= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( ( sK2 @ sK1 )
= $true )
& ( ( ( sK2 @ sK1 )
= $true )
| ( $true
!= ( sK0 @ sK1 ) ) )
& ( ( ( sK2 @ sK1 )
!= $true )
| ( $true
= ( sK0 @ sK1 ) ) )
& ( $true
!= ( sK0 @ sK1 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f9,f10]) ).
thf(f10,plain,
( ? [X0: a > $o,X1: a,X2: a > $o] :
( ( ( X2 @ X1 )
= $true )
& ( ( ( X2 @ X1 )
= $true )
| ( $true
!= ( X0 @ X1 ) ) )
& ( ( ( X2 @ X1 )
!= $true )
| ( $true
= ( X0 @ X1 ) ) )
& ( $true
!= ( X0 @ X1 ) ) )
=> ( ( ( sK2 @ sK1 )
= $true )
& ( ( ( sK2 @ sK1 )
= $true )
| ( $true
!= ( sK0 @ sK1 ) ) )
& ( ( ( sK2 @ sK1 )
!= $true )
| ( $true
= ( sK0 @ sK1 ) ) )
& ( $true
!= ( sK0 @ sK1 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: a > $o,X1: a,X2: a > $o] :
( ( ( X2 @ X1 )
= $true )
& ( ( ( X2 @ X1 )
= $true )
| ( $true
!= ( X0 @ X1 ) ) )
& ( ( ( X2 @ X1 )
!= $true )
| ( $true
= ( X0 @ X1 ) ) )
& ( $true
!= ( X0 @ X1 ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X2: a > $o,X1: a,X0: a > $o] :
( ( $true
= ( X0 @ X1 ) )
& ( ( $true
= ( X0 @ X1 ) )
| ( ( X2 @ X1 )
!= $true ) )
& ( ( $true
!= ( X0 @ X1 ) )
| ( ( X2 @ X1 )
= $true ) )
& ( ( X2 @ X1 )
!= $true ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X0: a > $o,X1: a,X2: a > $o] :
( ( ( $true
= ( X0 @ X1 ) )
| ( ( X2 @ X1 )
!= $true ) )
& ( ( $true
!= ( X0 @ X1 ) )
| ( ( X2 @ X1 )
= $true ) )
& ( ( X2 @ X1 )
!= $true )
& ( $true
= ( X0 @ X1 ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X0: a > $o,X1: a,X2: a > $o] :
( ( ( ( X2 @ X1 )
!= $true )
& ( $true
= ( X0 @ X1 ) ) )
=> ( ( ( ( X2 @ X1 )
= $true )
& ( $true
!= ( X0 @ X1 ) ) )
| ( ( ( X2 @ X1 )
!= $true )
& ( $true
= ( X0 @ X1 ) ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a,X2: a > $o] :
( ( ( ( X2 @ X1 )
!= $true )
& ( $true
= ( X0 @ X1 ) ) )
=> ( ( ( ( X2 @ X1 )
= $true )
& ( $true
!= ( X0 @ X1 ) ) )
| ( ( ( X2 @ X1 )
!= $true )
& ( $true
= ( X0 @ X1 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a,X2: a > $o] :
( ( ~ ( X2 @ X1 )
& ( X0 @ X1 ) )
=> ( ( ( X2 @ X1 )
& ~ ( X0 @ X1 ) )
| ( ~ ( X2 @ X1 )
& ( X0 @ X1 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X2: a,X1: a > $o] :
( ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) )
=> ( ( ( X1 @ X2 )
& ~ ( X0 @ X2 ) )
| ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X2: a,X1: a > $o] :
( ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) )
=> ( ( ( X1 @ X2 )
& ~ ( X0 @ X2 ) )
| ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.J2IGBikbH3/Vampire---4.8_18771',cBOOL_PROP_58_pme) ).
thf(f25,plain,
~ spl3_1,
inference(avatar_split_clause,[],[f12,f17]) ).
thf(f17,plain,
( spl3_1
<=> ( $true
= ( sK0 @ sK1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f12,plain,
( $true
!= ( sK0 @ sK1 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f24,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f13,f21,f17]) ).
thf(f13,plain,
( ( $true
= ( sK0 @ sK1 ) )
| ( ( sK2 @ sK1 )
!= $true ) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET599^5 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.37 % Computer : n011.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri May 3 17:01:08 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a TH0_THM_NEQ_NAR problem
% 0.16/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.J2IGBikbH3/Vampire---4.8_18771
% 0.23/0.39 % (18983)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.23/0.40 % (18983)First to succeed.
% 0.23/0.40 % (18984)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.23/0.40 % (18985)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.23/0.40 % (18988)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.23/0.40 % (18989)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.23/0.40 % (18987)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.23/0.40 % (18983)Refutation found. Thanks to Tanya!
% 0.23/0.40 % SZS status Theorem for Vampire---4
% 0.23/0.40 % SZS output start Proof for Vampire---4
% See solution above
% 0.23/0.40 % (18983)------------------------------
% 0.23/0.40 % (18983)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40 % (18983)Termination reason: Refutation
% 0.23/0.40
% 0.23/0.40 % (18983)Memory used [KB]: 5500
% 0.23/0.40 % (18983)Time elapsed: 0.004 s
% 0.23/0.40 % (18983)Instructions burned: 1 (million)
% 0.23/0.40 % (18983)------------------------------
% 0.23/0.40 % (18983)------------------------------
% 0.23/0.40 % (18979)Success in time 0.02 s
% 0.23/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------